Association Mining for Super Market Sales using UP Growth and Top-K Algorithm
نویسندگان
چکیده
منابع مشابه
Mining Top-K Association Rules
Mining association rules is a fundamental data mining task. However, depending on the choice of the parameters (the minimum confidence and minimum support), current algorithms can become very slow and generate an extremely large amount of results or generate too few results, omitting valuable information. This is a serious problem because in practice users have limited resources for analyzing t...
متن کاملMining Top-K Non-redundant Association Rules
Association rule mining is a fundamental data mining task. However, depending on the choice of the thresholds, current algorithms can become very slow and generate an extremely large amount of results or generate too few results, omitting valuable information. Furthermore, it is well-known that a large proportion of association rules generated are redundant. In previous works, these two problem...
متن کاملExMiner: An Efficient Algorithm for Mining Top-K Frequent Patterns
Conventional frequent pattern mining algorithms require users to specify some minimum support threshold. If that specified-value is large, users may lose interesting information. In contrast, a small minimum support threshold results in a huge set of frequent patterns that users may not be able to screen for useful knowledge. To solve this problem and make algorithms more user-friendly, an idea...
متن کاملPaper - High Utility Itemsets Mining on Incremental Transactions using UP - Growth and UP - Growth + Algorithm
One of the important research area in data mining is high utility pattern mining. Discovering itemsets with high utility like profit from database is known as high utility itemset mining. There are number of existing algorithms have been work on this issue. Some of them incurs problem of generating large number of candidate itemsets. This leads to degrade the performance of mining in case of ex...
متن کاملAn Efficient Enhancement of Mining Top-K Association Rule
Data mining on huge databases has been a major issue in research area, due to the problem of analyzing large volumes of data using traditional OLAP tools only. This type of process implies much computational power, disk I/O and memory, which can be used only by parallel computers. So, depending on the selection of the parameters (the minimum support and minimum confidence), current algorithms c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ITM Web of Conferences
سال: 2020
ISSN: 2271-2097
DOI: 10.1051/itmconf/20203203012